#include "BinarySearchTree.h"
void printTree(BSTree <int> &Treeroot)
{
    vector<int> vec= Treeroot.inorderTraversal();
    for (int i = 0; i < vec.size(); i++)
    {
        cout << vec[i] << " ";
    }
    cout << endl;
}

void Test_1()
{
    BSTree <int> Treeroot;
    int arr[] = {5,3,7,4,2,1,6,8,9};
    for (int i = 0; i < 9; i++)
    {
        Treeroot.insertR(arr[i]);
    }
    for (int i = 0; i < 9; i++)
    {
        int t = arr[i];
        Treeroot.eraseR(t);
        printTree(Treeroot);
    }
    return ;
}

// int main()
// {
//     Test_1();
//     return 0;
// }